Ancestral Graph Markov Models 963
نویسندگان
چکیده
This paper introduces a class of graphical independence models that is closed under marginalization and conditioning but that contains all DAG independence models. This class of graphs, called maximal ancestral graphs, has two attractive features: there is at most one edge between each pair of vertices; every missing edge corresponds to an independence relation. These features lead to a simple parameterization of the corresponding set of distributions in the Gaussian case.
منابع مشابه
Iterative Conditional Fitting for Gaussian Ancestral Graph Models
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property that is closed under conditioning and marginalization. By design, ancestral graphs encode precisely the conditional independence structures that can arise from Bayesian networks with selection and unobserved (hidden/la...
متن کاملMarkov Equivalence Classes for Maximal Ancestral Graphs
Ancestral graphs provide a class of graphs that can encode conditional independence re lations that arise in directed acyclic graph (DAG) models with latent and selection vari ables, corresponding to marginalization and conditioning. However, for any ancestral graph, there may be several other graphs to which it is Markov equivalent. We introduce a simple representation of a Markov equiv ale...
متن کاملGraphical Answers to Questions about Likelihood Inference for Gaussian Covariance Models
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph (alternatively graphs with dashed edges have been used for this purpose). Bi-directed graphs are special instances of ancestral graphs, which are mixed graphs with undirected, directed, and bi-directed edges. In this paper, we show how simplicial s...
متن کاملGenerating Markov Equivalent Maximal Ancestral Graphs by Single Edge Replacement
Maximal ancestral graphs (MAGs) are used to encode conditional independence relations in DAG models with hidden variables. Different MAGs may represent the same set of conditional independences and are called Markov equivalent. This paper considers MAGs without undirected edges and shows conditions under which an arrow in a MAG can be reversed or interchanged with a bi-directed edge so as to yi...
متن کاملMarkov properties for mixed graphs
In this paper, we unify the Markov theory of a variety of different types of graphs used in graphical Markov models by introducing the class of loopless mixed graphs, and show that all independence models induced by m-separation on such graphs are compositional graphoids. We focus in particular on the subclass of ribbonless graphs which as special cases include undirected graphs, bidirected gra...
متن کامل